The Sources of Kolmogorov ’ s
نویسنده
چکیده
Andrei Kolmogorov’s Grundbegriffe der Wahrscheinlichkeitsrechnung put probability’s modern mathematical formalism in place. It also provided a philosophy of probability—an explanation of how the formalism can be connected to the world of experience. In this article, we examine the sources of these two aspects of the Grundbegriffe—the work of the earlier scholars whose ideas Kolmogorov synthesized.
منابع مشابه
Impossibility of Independence Amplification in Kolmogorov Complexity Theory
The paper studies randomness extraction from sources with bounded independence and the issue of independence amplification of sources, using the framework of Kolmogorov complexity. The dependency of strings x and y is dep(x, y) = max{C(x)−C(x | y), C(y)−C(y | x)}, where C(·) denotes the Kolmogorov complexity. It is shown that there exists a computable Kolmogorov extractor f such that, for any t...
متن کاملA two - dimensional Kolmogorov – Smirnov test for crowded field source detection : ROSAT sources in NGC 6397
We present a two-dimensional version of the classical one-dimensional Kolmogorov– Smirnov (K-S) test, extending an earlier idea due to Peacock (1983) and an implementation proposed by Fasano & Franceschini (1987). The two-dimensional K-S test is used to optimise the goodness of fit in an iterative source-detection scheme for astronomical images. The method is applied to a ROSAT/HRI x-ray image ...
متن کاملPossibilities and impossibilities in Kolmogorov complexity extraction
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled using probability distributions and min-entropy to measure their quality and also by using individual strings and Kolmogorov complexity to measure their quality. Complexity theorists are more familiar with the first ap...
متن کاملKolmogorov Complexity: Sources, Theory and Applications
The theory of Kolmogorov complexity is based on the discovery, by Alan Turing in 1936, of the universal Turing machine. After proposing the Turing machine as an explanation of the notion of a computing machine, Turing found that there exists one Turing machine which can simulate any other Turing machine. Complexity, according to Kolmogorov, can be measured by the length of the shortest program ...
متن کاملExtracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
We apply results on extracting randomness from independent sources to “extract” Kolmogorov complexity. For any α, > 0, given a string x with K(x) > α|x|, we show how to use a constant number of advice bits to efficiently compute another string y, |y| = Ω(|x|), with K(y) > (1− )|y|. This result holds for both unbounded and space-bounded Kolmogorov complexity. We use the extraction procedure for ...
متن کامل